#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN(1e5+8);
int n,now(1);
int r[MAXN];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>r[i];
    }
    sort(r,r+n+1);
    for(int i=2;i<=n;i++){
        if(r[i]>r[now]){
            now++;
        }
    }
    cout<<n+1-now;
    return 0;
}
